%0 Conference Proceedings
%4 sid.inpe.br/sibgrapi@80/2007/07.23.17.55
%2 sid.inpe.br/sibgrapi@80/2007/07.23.17.55.05
%@doi 10.1109/SIBGRAPI.2007.26
%T Seed-relative segmentation robustness of watershed and fuzzy connectedness approaches
%D 2007
%A Audigier, Romaric,
%A Lotufo, Roberto de Alencar,
%@affiliation Faculdade de Engenharia Elétrica e de Computação, UNICAMP
%@affiliation Faculdade de Engenharia Elétrica e de Computação, UNICAMP
%E Falcão, Alexandre Xavier,
%E Lopes, Hélio Côrtes Vieira,
%B Brazilian Symposium on Computer Graphics and Image Processing, 20 (SIBGRAPI)
%C Belo Horizonte, MG, Brazil
%8 7-10 Oct. 2007
%I IEEE Computer Society
%J Los Alamitos
%S Proceedings
%K image segmentation, segmentation robustness, fuzzy connectedness, watershed transform, image foresting transform, minimum spanning forest, shortest-path forest.
%X This paper analyzes the robustness issue in three segmentation approaches: the iterative relative fuzzy object extraction, the watershed transforms (WT) by image foresting transform and by minimum spanning forest. These methods need input seeds, which can be source of variability in the segmentation result. So, the robustness of these segmentation methods in relation to the input seeds is focused. The core of each seed is defined as the region where the seed can be moved without altering the segmentation result. We demonstrate that the core is identical for the three methods providing that the tie-zone transform has previously been applied on these methods. Indeed, as the two WT approaches do not return unique solution, the set of possible solutions has to be considered in a unified solution. So does the tie-zone transform. As opposed to what we could think, we show that the core is included in but different from the catchment basin. We also demonstrate that the tie-zone transforms of these WTs are always identical. Furthermore, the framework of minimal sets of seeds, an inverse problem of segmentation, is extended to the pixel level and related to the cores. A new algorithm for the computation of minimal seed sets is finally proposed.
%@language en
%3 audigier_robust.pdf